Breaking through the Thresholds: an Analysis for Iterative Reweighted $\e ll_1$ Minimization via the Grassmann Angle Framework

It is now well understood that the 1 minimization algorithm is able to recover sparse signals from incomplete measurements [2], [1], [3] and sharp recoverable sparsity thresholds have also been obtained for the 1 minimization algorithm. However, even though iterative reweighted 1 minimization algorithms or related algorithms have been empirically observed to boost the recoverable sparsity thresholds for certain types of signals, no rigorous theoretical results have been established to prove this fact. In this paper, we try to provide a theoretical foundation for analyzing the iterative reweighted 1 algorithms. In particular, we show that for a nontrivial class of signals, the iterative reweighted 1 minimization can indeed deliver recoverable sparsity thresholds larger than that given in [1], [3]. Our results are based on a high-dimensional geometrical analysis (Grassmann angle analysis) of the null-space characterization for 1 minimization and weighted 1 minimization algorithms.